Novel Vantage- Scalable cache Compression Scheme
نویسندگان
چکیده
In today’s world speed is one of the important factor that is considered for selecting any electronic component in the market. Speed of a microprocessor based system mainly depends on the speed of the microprocessor which in turn depends on the memory access time. cache compression is one of the way to increase speed of a microprocessor based system since it increases cache capacity and off-chip bandwidth. Storing compressed lines in the cache increases the effective cache capacity. For example, a compressed L1 cache design where each set can store either one uncompressed line or two compressed lines. Increasing the effective cache size can eliminate misses and thereby reduce the time lost to long off-chip miss penalties. However, compression increases the cache hit time, since the decompression overhead lies on the critical access path. Depending upon the balance between hits and misses, cache compression has the potential to either greatly help or greatly hurt performance.
منابع مشابه
Intelligent scalable image watermarking robust against progressive DWT-based compression using genetic algorithms
Image watermarking refers to the process of embedding an authentication message, called watermark, into the host image to uniquely identify the ownership. In this paper a novel, intelligent, scalable, robust wavelet-based watermarking approach is proposed. The proposed approach employs a genetic algorithm to find nearly optimal positions to insert watermark. The embedding positions coded as chr...
متن کاملSACCS: Scalable Asynchronous Cache Consistency Scheme for Mobile Environments
In this paper, we propose a novel cache consistency maintenance scheme, called (SACCS), for mobile environments. It relies on the following three key features: (1) Use of flag bits at server and MU’s cache to maintain cache consistency; (2) Use of an identifier (ID) for each entry in MU’s cache after its invalidation in order to maximize the broadcast bandwidth efficiency; (3) Rendering all val...
متن کاملCache Consistency for Hierarchically - StructuredMultiprocessors
This paper presents a new cache consistency scheme for hierarchically-structured shared-memory multiprocessors. The scheme is simple, fast and eecient, and it does not require a large amount of state information to be maintained. The scheme exploits the broadcast capability of these systems, but limits the extent of the broadcasts by means of a novel ltering mechanism. As a speciic example, it ...
متن کاملThe Vantage Cache-partitioning Technique Enables Configurability and Quality-of-service Guarantees in Large-scale Chip Multiprocessors with Shared Caches. Caches Can Have Hundreds of Partitions with Sizes Specified at Cache Line Granularity, While Maintaining High Associativity and Strict Isolation among Partitions
......Shared caches are pervasive in chip multiprocessors (CMPs). In particular, CMPs almost always feature a large, fully shared last-level cache (LLC) to mitigate the high latency, high energy, and limited bandwidth of main memory. A shared LLC has several advantages over multiple, private LLCs: it increases cache utilization, accelerates intercore communication (which happens through the cac...
متن کاملFrequent Pattern Compression: A Significance-Based Compression Scheme for L2 Caches
With the widening gap between processor and memory speeds, memory system designers may find cache compression beneficial to increase cache capacity and reduce off-chip bandwidth. Most hardware compression algorithms fall into the dictionary-based category, which depend on building a dictionary and using its entries to encode repeated data values. Such algorithms are effective in compressing lar...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2013